Fine-grained Delaunay triangulation in a simulation of tumor spheroid growth

نویسندگان

  • Alessio Del Fabbro
  • Roberto Chignola
  • Edoardo Milotti
چکیده

The simulation of many-particle systems often requires the detailed knowledge of proximity relations to reduce computational complexity and to provide a basis for specific calculations. Here we describe the basic scheme of a simulator of tumor spheroid growth: the calculation of mechanical interactions between cells and of the concentrations of diffusing chemicals requires a backbone provided by the Delaunay triangulation and the volumes of the associated Voronoi regions. Thus the Delaunay triangulation provides both the proximity relations needed to reduce the computational complexity and the basic structures that are needed to carry out the calculation of the biochemical interactions between cells and with the enviroment. A 3D version of the simulator uses the CGAL library as an essential component for the efficient computation of the Delaunay triangulation and of the Voronoi regions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Challenges of Tumor Spheroid Modeling

The speed and the versatility of today's computers open up new opportunities to simulate complex biological systems. Here we review a computational approach recently proposed by us to model large tumor cell populations and spheroids, and we put forward general considerations that apply to any fine-grained numerical model of tumors. We discuss ways to bypass computational limitations and discuss...

متن کامل

Multicellular tumor spheroid in an off-lattice Voronoi-Delaunay cell model.

We study multicellular tumor spheroids by introducing a new three-dimensional agent-based Voronoi-Delaunay hybrid model. In this model, the cell shape varies from spherical in thin solution to convex polyhedral in dense tissues. The next neighbors of the cells are provided by a weighted Delaunay triangulation with on average linear computational complexity. The cellular interactions include dir...

متن کامل

Study on Delaunay Triangulation with the Islets Constraints

Aiming at Delaunay triangulation with islets constrains in terrain simulation. A general Delaunay triangulation algorithm for constrained data set with islets is proposed. The algorithm firstly constructs Constrained Delaunay Triangulation with constraint polygons which are inner boundary of islets, then according to topological relations within edge, surface, arc segment, applies bidirectional...

متن کامل

Automatic Blocking Scheme for Structured Meshing in 2d Multiphase Flow Simulation

We present an automatic algorithm to construct blocking scheme for multiblock structured meshes in 2D multiphase flow problems. Our solution is based on the concepts of medial axis and Delaunay triangulation. We show that the quality of the blocking scheme strongly depends on the quality of Delaunay triangulation. Therefore, well-known techniques and issues like Delaunay refinement and geometri...

متن کامل

Constrained Delaunay Triangulation for Ad Hoc Networks

Geometric spanners can be used for efficient routing in wireless ad hoc networks. Computation of existing spanners for ad hoc networks primarily focused on geometric properties without considering network requirements. In this paper we propose a new spanner called Constrained Delaunay Triangulation (CDT) which considers both geometric properties and network requirements. The CDT is formed by in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006